Improving chaos-based pseudo-random generators in finite-precision arithmetic

One of the widely-used ways in chaos-based cryptography to generate pseudo-random sequences is use least significant bits or digits finite-precision numbers defined by chaotic orbits. In this study, we show that results obtained using such an approach are very prone rounding errors and discretization effects. Thus, it appears generated close random even when parameters correspond non-chaotic oscillations. confirm actual source properties a binary representation can not be chaos, but computer simulation. We propose technique for determining maximum number used as output sequence generator including algorithms. The considered involves evaluating difference two points different numerical methods same order accuracy. Experimental estimation significantly increase performance existing generators. reconsider improve cryptographic